The augmentation algorithm and molecular phylogenetic trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithm for construction of phylogenetic trees.

An algorithm is described for the construction of phylogenetic trees. The algorithm is based on the progressive correction of data along the tree construction. For the correction, the average value of the difference between each pair of neighbour elements to the rest of the table is considered.

متن کامل

Phylogenetic test of the molecular clock and linearized trees.

To estimate approximate divergence times of species or species groups with molecular data, we have developed a method of constructing a linearized tree under the assumption of a molecular clock. We present two tests of the molecular clock for a given topology: two-cluster test and branch-length test. The two-cluster test examines the hypothesis of the molecular clock for the two lineages create...

متن کامل

Matchings and phylogenetic trees.

This paper presents a natural coordinate system for phylogenetic trees using a correspondence with the set of perfect matchings in the complete graph. This correspondence produces a distance between phylogenetic trees, and a way of enumerating all trees in a minimal step order. It is useful in randomized algorithms because it enables moves on the space of trees that make random optimization str...

متن کامل

Operads and phylogenetic trees

We construct an operad Phyl whose operations are the edge-labelled trees used in phylogenetics. This operad is the coproduct of Com, the operad for commutative semigroups, and [0,∞), the operad with unary operations corresponding to nonnegative real numbers, where composition is addition. We show that there is a homeomorphism between the space of n-ary operations of Phyl and Tn × [0,∞)n+1, wher...

متن کامل

Phylogenetic trees

We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Molecular Evolution

سال: 1979

ISSN: 0022-2844,1432-1432

DOI: 10.1007/bf01732032